A Computing Persistent Homology within Coq/SSReflect
نویسندگان
چکیده
Jónathan Heras, School of Computing, University of Dundee, UK Thierry Coquand, Department of Computer Science and Engineering, Chalmers University of Technology and University of Gothenburg, Sweden Anders Mörtberg, Department of Computer Science and Engineering, Chalmers University of Technology and University of Gothenburg, Sweden Vincent Siles, Department of Computer Science and Engineering, Chalmers University of Technology and University of Gothenburg, Sweden
منابع مشابه
Proof Pattern Search in Coq/SSReflect
ML4PG is an extension of the Proof General interface of Coq, allowing the user to invoke machine-learning algorithms and find proof similarities in Coq/SSReflect libraries. In this talk, we will show the recent ML4PG features in action, using examples from the standard SSReflect library and HoTT library. We will compare ML4PG with traditional Coq searching tools and dependency graphs.
متن کاملIncidence Simplicial Matrices Formalized in Coq/SSReflect
Simplicial complexes are at the heart of Computational Algebraic Topology, since they give a concrete, combinatorial description of otherwise rather abstract objects which makes many important topological computations possible. The whole theory has many applications such as coding theory, robotics or digital image analysis. In this paper we present a formalization in the COQ theorem prover of s...
متن کاملInterfacing Coq + SSReflect with GAP
We report on an extendable implementation of the communication interface connecting Coq proof assistant to the computational algebra system GAP using the Symbolic Computation Software Composability Protocol (SCSCP). It allows Coq to issue OpenMath requests to a local or remote GAP instances and represent server responses as Coq terms.
متن کاملEfficient Finite-Domain Function Library for the Coq Proof Assistant*
Finiteness is an important concept in the computer science. In particular, finite-domain functions are a useful concept for representing various data structures such as finite graphs, finite automata and matrices, and used in quite a few programs. We provide finite-domain function libraries in Coq [12], which improves the efficiency of code extracted from proofs without forcing one to rewrite t...
متن کاملA Library for Algorithmic Game Theory in Ssreflect/Coq
We report on the formalization in Ssreflect/Coq of a number of concepts and results from algorithmic game theory, including potential games, smooth games, solution concepts such as Pure and Mixed Nash Equilibria, Coarse Correlated Equilibria, -approximate equilibria, and behavioral models of games such as better-response dynamics. We apply the formalization to prove Price of Stability bounds fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013